Fast optimal load balancing algorithms for 1D partitioning
نویسندگان
چکیده
منابع مشابه
Fast optimal load balancing algorithms for 1D partitioning
One-dimensional decompositionof nonuniformworkload arrays for optimal load balancing is investigated. The problemhas been studied in the literature as "chains-on-chains partitioning" problem. Despite extensive research efforts, heuristics are still used in parallel computing community with the "hope" of good decompositions and the "myth" of exact algorithms being hard to implement and not runti...
متن کاملTwo System State Calculation Algorithms for Optimal Load Balancing
In distributed systems, servers offer their service to independent clients. It is the load balancing problem to assign jobs to servers. Dynamic load balancing has great potential to outperform static policies in spite of the overhead for measurement and system state information exchange. Problems arise if the system state information used as criterion for the job assignment is not up to date. T...
متن کاملPartitioning of unstructured meshes for load balancing
Many large-scale engineering and scientiic calculations involve repeated updating of variables on an unstructured mesh. To do these types of computations on distributed memory parallel computers, it is necessary to partition the mesh among the processors so that the load balance is maximized and inter-processor communication time is minimized. This can be approximated by the problem of partitio...
متن کاملLoad Balancing Algorithms for SPMDApplications ?
This paper deals with the problem of load balancing in SPMD parallel applications. Based on the study of recent work in the area, we propose a taxonomy that provides a terminology and a framework for describing and classifying the growing number of SPMD load balancing algorithms. This allows more thorough and systematic comparison studies of diierent load balancing techniques, helping designers...
متن کاملFast Diffusion Load Balancing Algorithms on Torus Graphs
In this paper, we consider the application of accelerated methods in order to increase the rate of convergence of the diffusive iterative load balancing algorithms. In particular, we compare the application of Semi-Iterative, Second Degree and Variable Extrapolation techniques on the basic Diffusion method and the Extrapolated Diffusion method for torus graphs. It is shown that our methods requ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2004
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2004.05.003